Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity
نویسندگان
چکیده
1 Abbreviations and Notations 4
منابع مشابه
Information Complexity for Multiparty Communication
In this paper, we have studied the information complexity for the communication model involving more than two parties. A lot of work has already been done on the information complexity in two party communication model and the question of extending the definition of information complexity to the multiparty communication model was posed in [Bra12]. In this paper, we first give a definition of int...
متن کاملDirect Sum Questions in Classical Communication Complexity
In 1988, Karchmer and Wigderson generalized Yao’s two-party communication model of functions to relations and showed a remarkable connection of this model to the Boolean circuit model. A few years later, continuing this line of work, Karchmer, Raz, and Wigderson proposed a program to separate NC from P through direct-sum-type inequalities in communication complexity. This spurred the study of t...
متن کاملHellinger volume and number-on-the-forehead communication complexity
Information-theoretic methods have proven to be a very powerful tool in communication complexity, in particular giving an elegant proof of the linear lower bound for the two-party disjointness function, and tight lower bounds on disjointness in the multi-party number-in-the-hand (NIH) model. In this paper, we study the applicability of information theoretic methods to the multiparty number-on-t...
متن کاملLanguages with Bounded Multiparty Communication Complexity
We study languages with bounded communication complexity in the multiparty “input on the forehead model” with worst-case partition. In the two-party case, languages with bounded complexity are exactly those recognized by programs over commutative monoids [20]. This can be used to show that these languages all lie in shallow ACC. In contrast, we use different coding techniques to show that there...
متن کاملMultiparty Communication Complexity of Finite Monoids
We study the relationship between the complexity of languages, in Yao's 2-party communication game and its extensions, and the algebraic properties of nite monoids that can recognize them. For a nite monoid M, we deene C (k) (M) to be the maximum number of bits of communication that players need to exchange, in the k-party game of Chandra, Furst and Lipton, to decide membership in any language ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017